package com.vint.lintcode;

import com.vint.common.TreeNode;

import java.util.ArrayList;
import java.util.List;

/**
 * 打印所有二叉树路径，其和等于给定值
 */
public class Lintcode376 {
	public List<List<Integer>> binaryTreePathSum(TreeNode root, int target) {
		List<List<Integer>> ret = new ArrayList<>();
		return ret;
	}
	public static void main(String[] args) {
	}
}
